Binary Fuse Filters: Fast and Smaller Than Xor Filters

Bloom and cuckoo filters provide fast approximate set membership while using little memory. Engineers use them to avoid expensive disk network accesses. The recently introduced xor can be faster smaller than filters. are within 23% of the theoretical lower bound in storage as opposed 44% for Inspired by Dietzfelbinger Walzer, we build probabilistic -- called binary fuse that 13% without sacrificing query speed. As an additional benefit, construction new more twice By slightly speed, further reduce 8% bound. We compare performance against a wide range competitive alternatives such filters, blocked vector quotient recent ribbon Our experiments suggest superior